• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    The invention provides an addressing method for bus subscribers of a bus for building services equipment, in particular operating devices for lighting means, wherein the bus subscribers are connected via the bus to at least one control unit, comprising the steps: A.) the bus subscribers each internally assign a randomly generated address or are externally provided with such, B.) the control unit performs a search in an address search space and sends a search address that limits the address search space, C.) each bus subscriber whose randomly generated address is in the address search space, sends to the signal there is a response to the control unit, D.) the control unit reduces the address search space and performs steps B.) to D.) until only one bus user answers in step C.). In step C.) each bus user sends with his answer his address or an address difference information indicating how far his address is from the search address.
    公开号:AT15997U1
    申请号:TGM316/2015U
    申请日:2015-11-05
    公开日:2018-10-15
    发明作者:
    申请人:Tridonic Gmbh & Co Kg；
    IPC主号:
    专利说明:

    description
    ADDRESSING METHOD FOR BUILDING TECHNOLOGY DEVICE PARTICIPANTS The present invention relates to an addressing method for bus subscribers of a bus for building technology devices and in particular operating devices for illuminants, the bus subscribers being connected via the bus to at least one control unit. The invention further relates to a control unit for such an addressing method and at least one bus participant and a bus system with such a control unit and at least one such bus participant.
    In particular, the invention relates to the assignment of operating addresses for operating devices for lamps and in particular operating devices that are designed for the DALI or DSI standard and are compatible with it. The operating devices or bus participants can receive and evaluate the commands based on the DALI or DSI protocol. More precisely, the invention relates to a control unit determining a provisional or randomly generated address assigned to a bus subscriber by a random number generator, in order to finally assign the bus subscriber a further address, in particular an operating address or DALI or DSI short address.
    The DALI standard itself and the application WO 95/14972 A1 are known.
    At the beginning of the addressing process, each bus participant on the bus assigns itself an address generated by a random or pseudo-random generator. Each bus participant can either have such a random generator itself in order to generate a corresponding address, or the corresponding provisional address can be supplied externally to the bus participant via a central random generator. The randomly generated address is also referred to below as the provisional address.
    Then, according to the prior art, a controller starts a query according to a predetermined search algorithm and asks whether bus subscribers are connected with a search address to the bus, which have a provisional address that is smaller than the search address, or lies in an address search space which is formed by the search address and a limit of the address search space (for example an address search space from a previous search). It is important that the response of the bus participants, which can also be sensors or actuators or control gear for controlling such sensors and actuators (e.g. motors, acoustic signal generators, ...), respond to the search query the control unit is transmitted.
    This is a qualitative answer, namely either encoded information that indicates that a bus participant is in the queried address search range (for example, YES / YES, coded by the hexadecimal value FF, at which the level on the bus accordingly is changed). Otherwise there is no feedback, the level on the bus remains unchanged, for example high, which can be evaluated (also as coding of NO).
    It should be noted that, according to the prior art, the search is carried out until the bus subscriber with the smallest / largest address has been clearly identified. Since the exact match of the search address with the address of the bus subscriber indicates that the corresponding address was found, several iterations of performing the search are necessary until the address of the bus subscriber is reached, even if only one bus subscriber has already answered the search ,
    The invention therefore makes it its task to accelerate the address search. The central point of the invention is that the response of the bus subscribers is not only purely qualitative, but quantitative, and so each bus subscriber in particular answers the distance between the search address output by the control unit and the address assigned to it, or directly with its assigned bus address ant1 / 15
    AT15 997U1 2018-10-15 Austrian
    Patent office word et.
    The essence of the invention is the subject of the independent claims, further developments of the invention are the subject of the dependent claims.
    [0010] In a first aspect, an addressing method for bus participants of a bus for building technology devices, in particular operating devices for lamps, is provided, the bus participants being connected to at least one control unit via the bus, comprising the steps:
    A.) the bus participants each assign an internally generated address or are provided with such an address externally, B.) the control unit performs a search in an address search space and sends a search address that limits the address search space , C.) each bus subscriber, whose randomly generated address is in the address search space, sends a response to the control unit in response to the signal, [0014] D.) the control unit reduces the address search space and carries out steps B.) to D .) until only one bus participant answers in step C.). In step C.), each bus participant sends his address with his answer or an address difference information which indicates how far his address is from the search address, in particular via the bus to the control unit.
    [0015] The control unit can determine the randomly generated address of the bus subscriber from the search address and the address difference information. The control unit can assign a further address to the bus subscriber. The further address can be an operating address of a lighting bus system.
    The control unit can search for the bus subscriber with the smallest or largest randomly generated address.
    [0017] Each bus subscriber can have a random or pseudo random number generator and thus generate the randomly generated address.
    The control unit can increase the search address in step D.) if the control unit does not receive a response.
    The randomly generated address can consist of several, in particular three bytes. The control unit can carry out steps B.) to D.) for each byte.
    [0020] The response can have type information which indicates to which byte the address difference information applies.
    The bus participants can be sensors and / or actuators.
    The signal can be a broadcast signal that is sent in particular to all bus participants.
    The control unit can differentiate whether no response or whether the response was received by one or more bus users.
    The bus can be a DALI or DSI bus. The further address can be a DALI or DSI short address.
    In a further aspect, a control unit for bus participants of a bus for building technology devices, in particular operating devices for lamps, is provided, the control unit being connected to the bus participants via the bus and being set up to perform a search in an address search space in step A. ) and to send a search address that limits the address search space and to receive a response from each bus subscriber whose randomly generated address is in the address search space, and which is further configured to reduce the address search space in a step B.) and the Perform steps A.) to B.) until only one bus participant answers. The control unit receives in
    2.15
    AT15 997U1 2018-10-15 Austrian patent office answers and / or evaluates a randomly generated address of a bus subscriber or address difference information which indicates how far the randomly generated address of the bus subscriber is from the search address.
    [0026] The randomly generated address of a bus subscriber can be determined from the search address and the address difference information. Another address can be assigned to the bus subscriber.
    In a still further aspect, a bus subscriber, in particular an operating device for lamps, is provided, the bus subscriber being connected via the bus to at least one control unit and internally assigning itself a randomly generated address or receiving and assigning one externally, and in response to a signal having a search address that delimits an address search space, sends a response to the control unit if the randomly generated address is in the address search space. With its response, the bus subscriber sends its randomly generated address or address difference information to the control unit, which indicates how far its randomly generated address is from the search address.
    In yet another aspect, a bus system comprising a plurality of bus users for building technology devices, in particular operating devices for lamps, is provided, the bus users being connected via the bus to at least one control unit and each internally generating a randomly generated address in step A.) assign or be provided with such externally, the control unit in a step B.) performs a search in an address search space and sends a search address that limits the address search space, each bus subscriber, whose randomly generated address is in the address search space, on the signal out in a step C.) sends a response to the control unit, and the control unit reduces the address search space in a step D.) and carries out steps B.) to D.) until only one bus participant answers in step C.). In step C), each bus subscriber sends his address or an address difference information which indicates how far his address is from the search address.
    The control unit can determine the randomly generated address of a bus subscriber from the search address and the address difference information and assign a further address to the bus subscriber.
    The invention will now be described with reference to the figures.
    1 shows an overview of a bus system according to the invention.
    2 schematically shows a sequence of the bus subscriber search, [0033] FIG. 3 shows an alternative search for bus subscribers by way of example.
    4 exemplarily illustrates the inventive method in a flowchart.
    A known method for addressing bus users is described in particular in the standard IEC62386-102, which is based on the generation of 24-bit random numbers.
    For example, according to the DALI standard, a bus subscriber with the lowest random number is to be selected by iterative approximation. If the bus participant is found, a short address is assigned to it and the bus participant is excluded from the subsequent search. The search then begins again and the bus subscriber with the smallest address is again searched for.
    The search is carried out by specifying a search number, in particular a 24-bit search number (in hexadecimal notation, for example FF FF FF, or OxFFFFFF, which corresponds to 3 times 8 bits and thus 3 bytes), which is transmitted to all bus subscribers (for example as a broadcast Signal). If a bus subscriber has a provisional address or random number that is less than or equal to the search address, then it answers the search query by transmitting a response to the control unit. If the bus subscriber has a provisional address that is larger than the search address, he does not answer.
    The control unit now differentiates whether there is no bus subscriber, exactly one bus subscriber,
    3.15
    AT15 997U1 2018-10-15 Austrian
    Patent office or whether several bus participants answer the search query. If several bus participants respond, the control unit changes the search number, in particular in such a way that the address search area, which is formed by the previous search number and a limit of the address search space, is substantially halved. For example, the search that begins with the hexadecimal FF (for OxFF) (for one byte) continues with the hexadecimal 7F, i.e. the address search space from OxFF to 0x00 or 255 to 0 is reduced to the address search space from 0x7F to 0x00, i.e. 127 to 0, and thus reduced by 128 decimal. If several bus participants report here, the search is continued with 0x3F, which corresponds to a halving by 64 decimal. In the example, the search is then continued with 0x1 F (reduction by 32 decimal).
    If no device answers, the address search space is enlarged in order to subsequently search for bus subscribers with the enlarged address search space. For example, answer when searching with 0x1 F, in continuation of the previous example, no bus subscriber, the address search space is increased by half the address search space of the previous search or the search number is increased. In the example, the search number has been reduced by a decimal 32. The search number is thus increased to 0x2F (by decimal 16).
    If only one device replies to the search query, the search is continued (change in the search number, or reduction / enlargement of the search space) until the search address has reached an exact match with the provisional bus subscriber address. The device with the smallest provisional address is then determined and another address, e.g. a DALI short address can be assigned to the device by the control unit.
    The iterative approximation of the search address to the provisional address of a bus subscriber is preferably carried out byte-wise by performing a search for an HI, an MI, and a LOByte of the provisional address separately.
    An example of a search for a byte, that is to say part of the provisional address, with the value 3F can then be carried out on the basis of the search number FF as follows:
    search number(hexadecimal) Decembervalue changethe search number reply steps FF 255 > 1 7F 127 -128 > 1 1 3F 63 -64 > 1 2 1F 31 -32 0 3 2F 47 16 0 4 37 55 8th 0 5 3B 59 4 0 6 3D 61 2 0 7 3E 62 1 0 8th 3F 63 1 1 found
    Thus, the time period for finding a bus subscriber is always fixed, since the same number of search requests is always required until a provisional address of a bus subscriber (smallest provisional address) is found. This is calculated as 3x8 steps for
    4.15
    AT15 997U1 2018-10-15 Austrian
    Patent office the 3 bytes with a 24 bit address.
    If only one bus participant answers after an earlier cut, it is still necessary that all remaining query steps are carried out until the search address and the provisional address of the bus participant exactly match. The bus participant is then considered selected.
    This results in a time-consuming process, the adaptation of the search address and the query in the exemplary DALI bus system each requiring two messages. This results in a time of approx. 25 ms each and thus approx. 50 ms for each step of the 24 search steps, which takes a total of approx. 1.2 s per bus participant.
    According to the present invention, the search is now modified so that each bus participant a distance between the search number and his provisional address, that is, an address difference information, in particular for each byte (Hl, MI, LO) upon a query from the control unit to the Control unit transmitted. If more than one device responds to the search query, the search is carried out as is known from the prior art, since the control unit cannot independently evaluate simultaneous responses from several participants.
    However, as soon as only one device responds to a search query, the address of the bus subscriber with the smallest / largest provisional address can be determined immediately on the basis of the transmitted address difference information, which indicates the distance between the provisional address of a bus subscriber and the search address. By knowing the distance, in particular the byte value, for the byte for which the search is carried out, from the corresponding byte of the provisional address, the remaining query steps can be skipped by the control unit and the search number can be directly related to the value of the provisional address or be set to the value of the corresponding byte of the provisional address. This results in significant time savings. Here too, as already indicated, the search can be carried out byte-wise, i.e. separately for each byte (HI, MI, LO).
    Subsequently, as is also known from the prior art, an additional address, in particular a DALI short address, can be assigned.
    In addition to the address difference information, the at least one bus subscriber can also transmit information relating to the byte type to which the address difference information applies. As a result, the control unit can carry out a more reliable transmission or a more reliable evaluation, since it is clear for which byte type the address difference information is transmitted.
    1 shows a bus system 1 as is exemplary of the invention. A control unit SE is shown therein, which is connected to bus subscribers BT1BT4 via one or more buses. The bus participants can in particular be operating devices for actuators or sensors. For example, the bus subscriber BT1 can be an operating device that operates a motor M. The bus subscriber BT2 can operate an acoustic signal generator, for example, while the bus subscriber BT3 can evaluate, process and send information from a sensor S. Finally, the bus subscriber BT4 can be an operating device for operating a lamp.
    2 now shows an exemplary method in which a search is carried out and the bus subscribers respond both with address difference information and with byte type information.
    Here, the answer contains, for example, an encoding ObCC BBBBBB, where BBBBBB represents address difference information which indicates a difference from the provisional address to the search address, in particular as a binary number. For example, binary 111111 (= decimal 63) stands for a difference of more than 63 in decimal notation. The coding ObCC can indicate the byte type and thus whether the address difference information BBBBBB indicates a deviation for the HI, MI, or LO byte. For example, encoding ObOO may indicate the address difference information for the LO byte while encoding 5/15
    AT15 997U1 2018-10-15 Austrian
    Patent regulations 0b01 and 0b10 define that the address difference information relates to the MI byte and the HI byte, respectively.
    By way of example, the search now starts with the search address OxFF FF FF (specified in hexadecimal notation, which corresponds to the decimal notation 255, 255, 255, with which 256 values (including the 0) are encoded). The bus participants now respond to a search request whenever their provisional address is smaller than the search address. They transmit a coded YES and indicate how far their provisional address deviates from the search address.
    For example, they can respond with a difference of 111111 to indicate that the deviation (> 63) is so large that it cannot be coded in the number of bits available. As long as several bus participants answer, the search corresponds to that from the prior art.
    However, as soon as only one bus participant responds, the control unit receives an indication of how far the search address is from the provisional address of the bus participant via the response of the bus participant. In the next step, the provisional address of the bus subscriber can then be selected directly as the search address. This saves the steps of iteratively approximating the provisional address of the bus subscriber.
    An example is shown in FIG. 2 in which three bus subscribers are sought. The search address column contains the search address used and the response column contains the responses received from the control unit. YES CORRUPTED stands for the fact that several responses from bus participants overlap and therefore no individual bus participant can be identified.
    On the other hand, YES CLEAR stands for the fact that a unique assignment of the byte-by-byte search can be determined by specifying the byte type (HI, MI or LO) based on the address difference information. In the example, a bus user U with an address 0xE1 C5 A1, a bus user V with the address 0x3F D1 53 and a bus user W with the address 0xE2 21 43 are shown.
    As shown in Fig. 2, the search thus starts with the address OxFF FF FF, whereby initially only the first byte is taken into account. Since in step 1 first several, namely all, bus nodes respond, since the hexadecimal address of the bus nodes is smaller than OxFF, the answer is YES CORRUPTED, since the answers of the bus nodes overlap to the control unit.
    The address search space is thus halved by the choice of a new search address in that the search address 0x7F FF FF is now used as the search address. Here too, several bus participants report, since here too all addresses for the byte H1 have smaller values. The search space is thus further reduced by the selection of a new search address by selecting the address 0x3F FF FF as the search address. By choosing a smaller search address 0x1 F FF FF again, no bus participant will respond anymore, since all HI byte values of the bus participant addresses are larger than the search address for this byte. The value of the search address is then increased successively and in particular by half the difference between the search address and the previous search address.
    [0060] There are thus a number of steps in which the search address is successively increased in value again, and the address of a bus subscriber is thus approached from “below”.
    Finally, in step 10 of FIG. 2, a bus subscriber with the value 3F for the HlByte is identified. The response “HI_deita_V = 0dez of the bus subscriber V indicates that there is a difference value from decimal 0 to the search address for the HI byte, with which the byte is uniquely identified.
    The search is now carried out for the second byte of the provisional address, the address search space again being halved and, since no bus subscriber is responding,
    6.15
    AT15 997U1 2018-10-15 Austrian
    Patent Office again increased the search address (from step 11 to step 12 in Fig. 2). After a further increase in the search address from step 12 to step 13, a bus participant finally reports, whose value for the MI byte only differs by an amount of decimal 14 from the search address (MI_delta_V = 14dez). With this, the value of the MI byte can be clearly determined by the control unit.
    In the next step, a search is carried out for the value of the LO byte, which already provides a clear answer for this byte when the search begins with the value 7F. The control unit receives a response for the LO byte of a subscriber, which indicates that the provisional address differs by 44 decimal from the search address (LO_delta_V = 44dez). The address of the bus subscriber V can thus be clearly determined in step 14.
    The search for the bus subscribers U and W runs analogously, it being noted here that, for example, as shown in step 26, the address difference information does not provide any clear information about the deviation of the search address from the provisional address (the difference for the LO -Byte of bus node U is specified with> 63 as a decimal value, LO_delta_U => 63dez). The search is then continued as described above until a clear difference value is determined. This is also shown in steps 29 to 34 for the operating device W.
    3 now shows a sequence example for a search according to the invention, in which no coding for the bytes HI, MI and LO takes place.
    The response of an operating device relates to the last changed search address and, if several bytes of the search address have been changed, preferably to the HI byte. This drastically reduces the number of searches and the number of bits that can be used to encode the address difference information increases to 8 bits, for example. So much larger deviations can now be encoded. The byte is not specified in the response, but only the address difference information relating to the last changed search address is given.
    The search for the bus users U, V and W already mentioned in the previous example then takes place as shown in FIG. 3:
    In step 1, the search address OxFF FF FF is started again, which results in an answer YES, CORRUPTED.
    Already in the second step, the control unit receives a response (here from participant V) which contains address difference information about the new search address and indicates that a provisional address for the high byte deviates by the amount of decimal 63 (HI_deltaV = 63dec ). With the search address (0x3F) changed by this amount, further information is received from the control unit in the third step, according to which the MI byte of the search address deviates by 46 from the provisional address of a bus subscriber (MI_deltaV = 46dez). The control unit then changes the address for the byte MI and then receives a response in step 4 that the LO byte of a bus subscriber deviates by a decimal 202 (LO_deltaV = 202dez). The control unit can thus uniquely determine the address of the bus subscriber V.
    In steps 6 to 11 again a search is carried out according to the described scheme, in step 12 the control unit finally receives address difference information which indicates that the difference from the search address to a provisional address for the high byte is 0 and thus the high-byte component (of the bus subscriber U) has been found (HI_deltaU = 0dez). A search for the MI byte is then carried out in steps 13 to 15, in step 15 the difference between the search address and the provisional address is given as 26 and the MI byte component has thus been found for the bus subscriber (MI_deltaU = 26dec ). In step 16, the control unit can then use the reply from the bus subscriber to infer the LO byte component of the bus subscriber and the bus subscriber can thus be found (LO_deltaU = 94dez).
    7/15
    AT15 997U1 2018-10-15 Austrian
    Patent Office It should be noted once again that a bus subscriber for whom an address has already been determined does not take part in the further search.
    In steps 17 to 19, the address of the bus subscriber W is also found.
    The invention can thus significantly speed up the search for bus participants in a building technology device bus and thus offers a significant improvement over the search for the prior art.
    The search shown in FIG. 2 is more reliable since additional security is provided by the coded byte information.
    Alternatively, instead of address difference information (“delta), the provisional address itself can also be transmitted from the bus participants to the control unit. As soon as only one bus participant answers, the provisional address is determined and can be selected or is then considered selected. The methods presented allow a speed increase of 2x to 4x.
    It is to be understood here that instead of looking for a smallest provisional address, it is also possible to search for a largest provisional address. The search is then carried out, for example, not from the largest possible search address, but rather, for example, from the smallest possible search address (e.g. 0x00). Accordingly, the bus subscribers whose preliminary address is below a search address do not respond to a request from the control unit, but only the bus subscribers which have a provisional address greater than the search address. If no bus participants respond to the search query, the address search area is also enlarged here, while if there is a response from several bus participants, the search area is reduced. If only one bus participant replies, the search address is changed on the basis of the response until the search address matches the provisional address of the bus participant or the corresponding byte.
    Fig. 4 shows schematically and by way of example the inventive method. Starting from a start state 400, in which there is preferably still no randomly generated address on the bus users, a randomly generated address is generated in the bus users in a first step 401. In a second step 402, the search is started with a search address, as described above. The search address is then sent in a third step to the bus subscribers, who then check in the fourth step 404 whether the search address is smaller than its randomly generated address.
    If this is not the case for all bus subscribers (path N starting from the fourth step 404; no bus subscriber sends a response), the address search space is in a fifth step 405 for a new search by half the address search space of the current search, or by Half the size of an immediately preceding address search space change, enlarged. The search is then continued from the third step 403 with the enlarged address search space. On the other hand, if the control unit receives at least one response, i.e. the search address is smaller than at least one randomly generated address of a bus subscriber (path Y starting from the fourth step 404), the control unit checks in a sixth step 406 whether the answer is unambiguous, i.e. whether only one bus participant answered.
    If this is not the case (path N starting from the sixth step 406; more than one bus subscriber sends a response), the address search space in a seventh step 407 for a new search is half the address search space of the current search or half the size of an immediately preceding change in address search space. The search is then continued from the third step 403 with the reduced address search space.
    If the answer in the sixth step 406 is unambiguous, in an eighth step 408 the search address is set in accordance with the received response and the corresponding bus part 8/15
    AT15 997U1 2018-10-15 Austrian
    The patent holder is clearly identified.
    In a ninth step, it is checked whether all bus participants have been identified. If all bus subscribers have been identified (path Y starting from ninth step 409), the search ends in an end state 410. If not all bus subscribers are identified (path N starting from ninth step 409), the search is continued with second step 402 until all bus participants are identified.
    9.15
    AT15 997U1 2018-10-15 Austrian patent office
    权利要求:
    Claims (15)
    [1]
    Expectations
    1. Addressing method for bus subscribers (BT1-BT4) of a bus for building technology devices, in particular operating devices for illuminants, the bus subscribers being connected via the bus to at least one control unit (SE), comprising the steps:
    - A.) the bus participants (BT1-BT4) each assign a randomly generated address internally or are provided with one externally,
    B.) the control unit (SE) performs a search in an address search space and sends a search address that limits the address search space,
    C.) each bus subscriber (BT1-BT4) whose randomly generated address is in the address search space sends a response to the control unit (SE) in response to the signal,
    - D.) the control unit (SE) reduces the address search space and carries out steps B.) to D.) until in step C.) only one bus subscriber (BT4) answers, characterized in that
    - in step C.) each bus subscriber (BT1-BT4) sends its address with its response or an address difference information which indicates how far its address is from the search address.
    [2]
    2. Addressing method according to claim 1 or 2, wherein the control unit (SE) determines the randomly generated address of the one bus subscriber (BT4) from the search address and the address difference information and assigns a further address to the one bus subscriber (BT4).
    [3]
    3. Addressing method according to one of the preceding claims, wherein the control unit (SE) performs the search for the bus subscriber (BT4) with the smallest or largest randomly generated address.
    [4]
    4. Addressing method according to one of the preceding claims, wherein each bus subscriber (BT1-BT4) has a random or pseudo random number generator and thus generates the randomly generated address.
    [5]
    5. Addressing method according to one of the preceding claims, wherein the control unit (SE) increases the search address in step D.) if the control unit (SE) receives no response.
    [6]
    6. Addressing method according to one of the preceding claims, wherein the randomly generated address consists of several, in particular three bytes (Hl, MI, LO), and wherein the control unit (SE) steps B.) to D.) for each byte (Hl , MI, LO).
    [7]
    7. Addressing method according to one of the preceding claims, wherein the response has a type information that indicates which byte (HI, MI, LO) the address difference information applies.
    [8]
    8. Control unit (SE) for bus participants (BT1-BT4) of a bus for building technology devices, in particular operating devices for lamps, wherein
    - The control unit (SE) is connected to the bus subscribers (BT1-BT4) via the bus and is set up to carry out a search in an address search space in a step A.) and to send a search address which limits the address search space and a response to be received by every bus subscriber (BT1-BT4) whose randomly generated address is in the address search space and which is further configured to reduce the address search space in one step) and to carry out steps A.) to B.) until only one Bus participant (BT4) answers, characterized in that
    - The control unit (SE) is designed to receive and evaluate in the response a randomly generated address of a bus subscriber or an address difference information that indicates how far the randomly generated address of the bus subscriber is from the search address.
    10/15
    AT15 997U1 2018-10-15 Austrian
    Patent Office
    [9]
    9. Bus subscriber (BT1), in particular an operating device for illuminants, the bus subscriber (BT) being connected via the bus to at least one control unit (SE) and being set up to internally assign a randomly generated address or to receive one externally and to assign, and in response to a signal comprising a search address that delimits an address search space, to send a response to the control unit (SE) if the randomly generated address is in the address search space, characterized in that the bus subscriber (BT4) does so is set up with its response to send its randomly generated address or an address difference information to the control unit (SE), which indicates how far its randomly generated address is from the search address.
    [10]
    10. Bus system (1) comprising a plurality of bus users (BT1-BT4) for building technology devices, in particular operating devices for lamps, the bus users (BT1-BT4) being connected via the bus to at least one control unit (SE) and being designed in one step A.) to assign a randomly generated address internally or to be provided with one externally, the control unit (SE) is set up to carry out a search in an address search space in a step B.) and to send a search address which is the address search space limited, each bus subscriber (BT1-BT4), whose randomly generated address is in the address search space, is intended to send a response to the signal in a step C.) to the control unit (SE), and wherein the control unit ( SE) is further set up to reduce the address search space in a step D.) and to carry out steps B.) to D.) until only one bus subscriber (BT4 ) answers, characterized in that each bus subscriber (BT1-BT4) is set up to send in step C.) with its answer its address or an address difference information which indicates how far its address is from the search address.
    4 sheets of drawings
    [11]
    11/15
    AT15 997U1 2018-10-15 Austrian
    Patent Office
    Fig. 1
    [12]
    12/15
    AT15 997U1 2018-10 Austrian
    Patent Office
    Step | search address | Reply
    1 OxFF FF FF YES CORRUPTED 2 0x7F 11 II YES CORRÜPTED 3 0x3F TI 11 YES CORRÜPTED 4 OxlF TI 11 NO 5 0x2F II (1st NO 6 0x37 11 II NO 7 0x3B IT IT NO 8th 0x3D 1 * VT NO 9 0x3 E TI 11 NO 10 0x3F TI fl YES CLEAR, HI delta_V = Odez -> HI found 11 0x3F 7F U TI NO 12 0x3F BF 11 II NO 13 0x3F DF IT II YES CLEAR, Ml_delta_V = 14dez MI found 14 0x3F Dl 7F YES CLEAR, LO delta V = 44dez -> LO found ==> v found 15 OxFF FF FF YES, corrupted 16 0x7F (1 11 NO 17 OxBF II TI NO 18 OxDF 11 II NO 19 OxEF 11 II YES CORRUPTED 20 0xE7 IT 11 YES CORRUPTED 21 0xE3 IT 11 YES CORRUPTED 22 Oxel IT IT YES CLEAR, HI_delta_U = Odez HI found 23 OxEl 7F II IT NO 24 OxEl BF II IT NO 25 OxEl DF 11 IT YES CLEAR, MI_delta_U = 26dec MI found 26 OxEl C5 FF YES CLEAR, LO_delta_U => 63dec 27 OxEl C5 7F NO 28 OxEl C5 BF YES CLEAR, LO delta U = 31dez -> LO found ==> U found 29 OxFF FF FF YES CLEAR, HI_delta_W = 29dez HI found 30 0xE2 FF FF YES CLEAR, MI_delta_W => 63dec 31 0xE2 7F II TI YES CLEAR, MI_delta_W => 63dec 32 0xE2 3F II TI YES CLEAR, MI_delta_W = 42dez -> MI found 33 0xE2 21 FF YES CLEAR, LO_delta_W => 63dec 34 0xE2 21 7F YES CLEAR, LO delta W = 60 dec LO found ==> w found Fig. 2
    [13]
    13/15
    AT15 997U1 2018-10-15 Austrian
    Patent Office
    Step | Search Address [Answer
    OxFF FF FF YES CORRUPTED 0x7F π ri YES CLEAR, HI_deltaV = 63dez HI found 0x3 F h ri YES CLEAR, Ml_deltaV = 46dez -> MI found 0x3F Dl η ri YES clear, LO_deltaV = 202dez lo found==> V found
    5 OxFF FF FF YES CORRUPTED 6 0x7F n n μ ri NO 7 OxBF 11 sts II 11 NO 8th OxDF n η 11 11 NO 9 OxEF μ ri 11 u YES CORRUPTED 10 0xE7 π ri ii ir YES CORRUPTED 11 0xE3 π ri II 1F YES CORRUPTED 12 Oxel ri n ii ir YES CLEAR, HI_deltaU = Odez HI found 13 Oxel 7F ti ir NO 14 Oxel BF ii ir NO 15 Oxel DF ii ir YES CLEAR, Ml_deltaU = 26dez -> MI found 16 Oxel C5 FF YES CLEAR, LO_deltaU = 94dez -> LO found
    ==> u found.
    17 OxFF FF FF YES CLEAR, HI_deltaW = 29dec - -> HI found 18 0xE2 FF FF YES CLEAR, MI_deltaU = 222dez MI found 19 0xE2 21 FF YES CLEAR, LO deltaW = 188dec -> LO found ==> w found
    Fig. 3
    [14]
    14/15
    AT15 997U1 2018-10-15 Austrian
    Patent Office
    Fig. 4
    O r-1’'d
    [15]
    15/15
    类似技术:
    公开号 | 公开日 | 专利标题
    DE102010041810A1|2012-04-05|Method for automatic address assignment to similar bus subscribers
    DE102011087509A1|2013-06-06|Sensor transmission device and method for transmitting useful data from a plurality of sensors to a bus control device for a vehicle
    EP0616286A1|1994-09-21|Method of allocating bus addresses
    DE102017118565A1|2019-02-21|Method for operating a sensor arrangement in a motor vehicle on the basis of a DSI protocol
    DE10310250A1|2004-11-25|Electronic device identification method
    DE102008017281A1|2009-10-08|Automatic bus address assignment via collision check
    DE102018125894A1|2020-04-23|Procedure for resolving an address conflict with the Modbus RTU standard protocol
    DE10240832A1|2004-03-18|Data bus system has address assignment in initialisation phase using increasing numbers of equipment serial number bits
    EP2733910A1|2014-05-21|BUS system, method for operating a BUS system and fluid system with a BUS system
    WO2018149908A1|2018-08-23|Method for operating a sensor arrangement on the basis of a dsi protocol and a corresponding sensor arrangement
    WO2018172197A1|2018-09-27|Method and device for controlling a terminal
    AT15997U1|2018-10-15|Addressing procedure for building technology device bus users
    DE19812163C2|2002-03-07|Device identification and initialization procedures
    EP1891776A1|2008-02-27|Method for operating a bus system, bus system and bus user
    DE102015121291A1|2017-06-08|Bus arrangement with subscriber with security address and method for operating a bus arrangement
    EP2826227B1|2020-07-15|Method for operating a network
    WO2010048987A1|2010-05-06|Device for a lamp application, method for communication between devices
    EP3602983B1|2020-04-29|Energy-efficient exchange of data frames
    DE102004039447A1|2005-12-15|Automatic address allocation to subscribers of system, by storing identifier of corresponding subscriber in master, and marking allocated addresses as taken
    BE1025127B1|2018-11-16|Communication system for serial communication between communication devices
    DE102007050642B4|2012-06-21|Electronic network with method for generating and allocating identification codes
    DE102017117225B3|2019-01-03|Communication system with bus and coding line
    DE102012203958A1|2013-09-19|Method for operating a network
    EP1331794A2|2003-07-30|Method for address allocation in a network and components therefore
    DE102019125493A1|2021-03-25|Slave device, bus system and method
    同族专利:
    公开号 | 公开日
    EP3139575A1|2017-03-08|
    EP3139575B1|2018-04-11|
    DE102015216850A1|2017-03-09|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    WO1995014972A1|1993-11-29|1995-06-01|Philips Electronics N.V.|Ranking-based address assignment in a modular system|
    US20060277309A1|2005-06-03|2006-12-07|Ems Technologies, Inc.|Method and system for discovering antenna line devices|
    DE102008017509A1|2008-04-04|2009-10-08|Semperlux Aktiengesellschaft - Lichttechnische Werke -|Installation with DALI bus|
    US20120271924A1|2011-04-19|2012-10-25|Spitaels James S|System and method for automatically addressing devices in a multi-drop network|
    EP2560348A2|2011-08-19|2013-02-20|Schneider Electric Industries SAS|Automatic addressing method of a plurality of slaves in a master slave network|
    DE102012210959A1|2012-06-27|2014-01-02|Zumtobel Lighting Gmbh|Distributed consumer control system and system commissioning process|
    US10320742B2|2017-06-01|2019-06-11|American Sterilizer Company|Address assignment system and method for surgical lighthead components|
    法律状态:
    2019-07-15| MM01| Lapse because of not paying annual fees|Effective date: 20181130 |
    优先权:
    申请号 | 申请日 | 专利标题
    DE102015216850.6A|DE102015216850A1|2015-09-03|2015-09-03|Addressing procedure for building technology device bus users|
    [返回顶部]